0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : run_E %s %d THM
0.11/0.32	% Computer : n024.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Aug  9 03:37:52 EDT 2022
0.11/0.32	% CPUTime    : 
0.16/0.46	Running higher-order on 8 cores theorem proving
0.16/0.46	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.16/0.46	# Version: 3.0pre003-ho
0.16/0.51	# Preprocessing class: HSLSSMSSSSLCHSA.
0.16/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.16/0.51	# Starting sh2 with 480s (4) cores
0.16/0.51	# Starting full_lambda_3 with 120s (1) cores
0.16/0.51	# Starting ehoh_best7_lambda with 120s (1) cores
0.16/0.51	# Starting post_as_ho9 with 120s (1) cores
0.16/0.51	# Starting almost_fo_4 with 120s (1) cores
0.16/0.51	# full_lambda_3 with pid 18819 completed with status 0
0.16/0.51	# Result found by full_lambda_3
0.16/0.51	# Preprocessing class: HSLSSMSSSSLCHSA.
0.16/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.16/0.51	# Starting sh2 with 480s (4) cores
0.16/0.51	# Starting full_lambda_3 with 120s (1) cores
0.16/0.51	# SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
0.16/0.51	# ...ProofStateSinE()=211/404
0.16/0.51	# Search class: HGHSM-FSLM32-DHSFFSBN
0.16/0.51	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.16/0.51	# Starting full_lambda_3 with 62s (1) cores
0.16/0.51	# full_lambda_3 with pid 18824 completed with status 0
0.16/0.51	# Result found by full_lambda_3
0.16/0.51	# Preprocessing class: HSLSSMSSSSLCHSA.
0.16/0.51	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.16/0.51	# Starting sh2 with 480s (4) cores
0.16/0.51	# Starting full_lambda_3 with 120s (1) cores
0.16/0.51	# SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
0.16/0.51	# ...ProofStateSinE()=211/404
0.16/0.51	# Search class: HGHSM-FSLM32-DHSFFSBN
0.16/0.51	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.16/0.51	# Starting full_lambda_3 with 62s (1) cores
0.16/0.51	# Preprocessing time       : 0.006 s
0.16/0.51	
0.16/0.51	# Proof found!
0.16/0.51	# SZS status Theorem
0.16/0.51	# SZS output start CNFRefutation
0.16/0.51	thf(decl_22, type, binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a).
0.16/0.51	thf(decl_23, type, binary476621312_Tip_a: binary1439146945Tree_a).
0.16/0.51	thf(decl_24, type, binary256242811Tree_a: binary1439146945Tree_a > set_a).
0.16/0.51	thf(decl_25, type, binary1226383794sert_a: (a > int) > a > binary1439146945Tree_a > binary1439146945Tree_a).
0.16/0.51	thf(decl_26, type, binary504661350_eqs_a: (a > int) > a > set_a).
0.16/0.51	thf(decl_27, type, binary2053421120memb_a: (a > int) > a > binary1439146945Tree_a > $o).
0.16/0.51	thf(decl_28, type, binary945792244etOf_a: binary1439146945Tree_a > set_a).
0.16/0.51	thf(decl_29, type, binary1721989714Tree_a: (a > int) > binary1439146945Tree_a > $o).
0.16/0.51	thf(decl_30, type, binary670562003pred_a: (a > int) > a > a > binary1439146945Tree_a > $o).
0.16/0.51	thf(decl_31, type, minus_minus_a_o: (a > $o) > (a > $o) > a > $o).
0.16/0.51	thf(decl_32, type, minus_minus_o: $o > $o > $o).
0.16/0.51	thf(decl_33, type, minus_minus_int: int > int > int).
0.16/0.51	thf(decl_34, type, minus_minus_set_a: set_a > set_a > set_a).
0.16/0.51	thf(decl_35, type, the_a: (a > $o) > a).
0.16/0.51	thf(decl_36, type, if_a: $o > a > a > a).
0.16/0.51	thf(decl_37, type, sup_sup_a_o: (a > $o) > (a > $o) > a > $o).
0.16/0.51	thf(decl_38, type, sup_sup_o: $o > $o > $o).
0.16/0.51	thf(decl_39, type, sup_sup_int: int > int > int).
0.16/0.51	thf(decl_40, type, sup_sup_set_a: set_a > set_a > set_a).
0.16/0.51	thf(decl_41, type, bot_bot_a_o: a > $o).
0.16/0.51	thf(decl_42, type, bot_bot_o: $o).
0.16/0.51	thf(decl_43, type, bot_bot_set_a: set_a).
0.16/0.51	thf(decl_44, type, ord_less_a_o: (a > $o) > (a > $o) > $o).
0.16/0.51	thf(decl_45, type, ord_less_int: int > int > $o).
0.16/0.51	thf(decl_46, type, ord_less_set_a: set_a > set_a > $o).
0.16/0.51	thf(decl_47, type, ord_less_eq_a_o: (a > $o) > (a > $o) > $o).
0.16/0.51	thf(decl_48, type, ord_less_eq_int: int > int > $o).
0.16/0.51	thf(decl_49, type, ord_less_eq_set_a: set_a > set_a > $o).
0.16/0.51	thf(decl_50, type, collect_a: (a > $o) > set_a).
0.16/0.51	thf(decl_51, type, insert_a: a > set_a > set_a).
0.16/0.51	thf(decl_52, type, is_empty_a: set_a > $o).
0.16/0.51	thf(decl_53, type, is_singleton_a: set_a > $o).
0.16/0.51	thf(decl_54, type, pairwise_a: (a > a > $o) > set_a > $o).
0.16/0.51	thf(decl_55, type, remove_a: a > set_a > set_a).
0.16/0.51	thf(decl_56, type, the_elem_a: set_a > a).
0.16/0.51	thf(decl_57, type, member_a: a > set_a > $o).
0.16/0.51	thf(decl_58, type, e: a).
0.16/0.51	thf(decl_59, type, h: a > int).
0.16/0.51	thf(decl_60, type, t1: binary1439146945Tree_a).
0.16/0.51	thf(decl_61, type, t2: binary1439146945Tree_a).
0.16/0.51	thf(decl_62, type, x: a).
0.16/0.51	thf(decl_63, type, esk1_0: a).
0.16/0.51	thf(decl_64, type, esk2_1: set_a > a).
0.16/0.51	thf(decl_65, type, esk3_1: set_a > a).
0.16/0.51	thf(decl_66, type, esk4_4: a > set_a > a > set_a > set_a).
0.16/0.51	thf(decl_67, type, esk5_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_68, type, esk6_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_69, type, esk7_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_70, type, esk8_2: a > set_a > set_a).
0.16/0.51	thf(decl_71, type, esk9_2: a > set_a > set_a).
0.16/0.51	thf(decl_72, type, esk10_1: set_a > a).
0.16/0.51	thf(decl_73, type, esk11_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_74, type, esk12_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_75, type, esk13_3: set_a > set_a > (a > $o) > a).
0.16/0.51	thf(decl_76, type, esk14_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
0.16/0.51	thf(decl_77, type, esk15_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
0.16/0.51	thf(decl_78, type, esk16_4: set_a > (int > set_a) > int > int > int).
0.16/0.51	thf(decl_79, type, esk17_4: set_a > (int > set_a) > int > int > int).
0.16/0.51	thf(decl_80, type, esk18_4: int > (set_a > int) > set_a > set_a > set_a).
0.16/0.51	thf(decl_81, type, esk19_4: int > (set_a > int) > set_a > set_a > set_a).
0.16/0.51	thf(decl_82, type, esk20_4: int > (set_a > int) > set_a > set_a > set_a).
0.16/0.51	thf(decl_83, type, esk21_4: int > (set_a > int) > set_a > set_a > set_a).
0.16/0.51	thf(decl_84, type, esk22_4: int > int > (int > set_a) > set_a > int).
0.16/0.51	thf(decl_85, type, esk23_4: int > int > (int > set_a) > set_a > int).
0.16/0.51	thf(decl_86, type, esk24_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
0.16/0.51	thf(decl_87, type, esk25_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
0.16/0.51	thf(decl_88, type, esk26_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
0.16/0.51	thf(decl_89, type, esk27_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
0.16/0.51	thf(decl_90, type, esk28_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
0.16/0.51	thf(decl_91, type, esk29_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
0.16/0.51	thf(decl_92, type, esk30_4: int > int > (int > set_a) > set_a > int).
0.16/0.51	thf(decl_93, type, esk31_4: int > int > (int > set_a) > set_a > int).
0.16/0.51	thf(decl_94, type, esk32_4: set_a > (int > set_a) > int > int > int).
0.16/0.51	thf(decl_95, type, esk33_4: set_a > (int > set_a) > int > int > int).
0.16/0.51	thf(decl_96, type, esk34_4: set_a > set_a > (set_a > int) > int > set_a).
0.16/0.51	thf(decl_97, type, esk35_4: set_a > set_a > (set_a > int) > int > set_a).
0.16/0.51	thf(decl_98, type, esk36_4: set_a > set_a > (set_a > int) > int > set_a).
0.16/0.51	thf(decl_99, type, esk37_4: set_a > set_a > (set_a > int) > int > set_a).
0.16/0.51	thf(decl_100, type, esk38_2: set_a > set_a > a).
0.16/0.51	thf(decl_101, type, esk39_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a).
0.16/0.51	thf(decl_102, type, esk40_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a).
0.16/0.51	thf(decl_103, type, esk41_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a).
0.16/0.51	thf(decl_104, type, esk42_1: (binary1439146945Tree_a > $o) > a).
0.16/0.51	thf(decl_105, type, esk43_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a).
0.16/0.51	thf(decl_106, type, esk44_1: binary1439146945Tree_a > binary1439146945Tree_a).
0.16/0.51	thf(decl_107, type, esk45_1: binary1439146945Tree_a > a).
0.16/0.51	thf(decl_108, type, esk46_1: binary1439146945Tree_a > binary1439146945Tree_a).
0.16/0.51	thf(decl_109, type, esk47_4: int > (int > int) > int > int > int).
0.16/0.51	thf(decl_110, type, esk48_4: int > (int > int) > int > int > int).
0.16/0.51	thf(decl_111, type, esk49_4: int > (int > int) > int > int > int).
0.16/0.51	thf(decl_112, type, esk50_4: int > (int > int) > int > int > int).
0.16/0.51	thf(decl_113, type, esk51_4: int > int > (int > int) > int > int).
0.16/0.51	thf(decl_114, type, esk52_4: int > int > (int > int) > int > int).
0.16/0.51	thf(decl_115, type, esk53_1: int > int).
0.16/0.51	thf(decl_116, type, esk54_1: (int > int > $o) > int).
0.16/0.51	thf(decl_117, type, esk55_1: (int > int > $o) > int).
0.16/0.51	thf(decl_118, type, esk56_1: (int > int > $o) > int).
0.16/0.51	thf(decl_119, type, esk57_1: (int > int > $o) > int).
0.16/0.51	thf(decl_120, type, esk58_1: (int > int > $o) > int).
0.16/0.51	thf(decl_121, type, esk59_4: int > int > (int > int) > int > int).
0.16/0.51	thf(decl_122, type, esk60_4: int > int > (int > int) > int > int).
0.16/0.51	thf(decl_123, type, esk61_1: int > int).
0.16/0.51	thf(decl_124, type, esk62_1: (a > $o) > a).
0.16/0.51	thf(decl_125, type, esk63_2: (a > $o) > (a > $o) > a).
0.16/0.51	thf(decl_126, type, esk64_1: (a > $o) > a).
0.16/0.51	thf(conj_0, conjecture, ![X521:a]:((((h @ X521)!=(h @ x))<=(member_a @ X521 @ (binary504661350_eqs_a @ h @ e)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.16/0.51	thf(fact_242_less__irrefl, axiom, ![X9:int]:(~((ord_less_int @ X9 @ X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_242_less__irrefl)).
0.16/0.51	thf(fact_0_eqsLessX, axiom, ![X150:a]:(((member_a @ X150 @ (binary504661350_eqs_a @ h @ e))=>(ord_less_int @ (h @ X150) @ (h @ x)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_eqsLessX)).
0.16/0.51	thf(c_0_3, negated_conjecture, ~(![X521:a]:(((member_a @ X521 @ (binary504661350_eqs_a @ h @ e))=>((h @ X521)!=(h @ x))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.16/0.51	thf(c_0_4, plain, ![X9:int]:(~(ord_less_int @ X9 @ X9)), inference(fof_simplification,[status(thm)],[fact_242_less__irrefl])).
0.16/0.51	thf(c_0_5, plain, ![X1200:a]:((~(member_a @ X1200 @ (binary504661350_eqs_a @ h @ e))|(ord_less_int @ (h @ X1200) @ (h @ x)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_eqsLessX])])).
0.16/0.51	thf(c_0_6, negated_conjecture, ((member_a @ esk1_0 @ (binary504661350_eqs_a @ h @ e))&((h @ esk1_0)=(h @ x))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
0.16/0.51	thf(c_0_7, plain, ![X1572:int]:(~(ord_less_int @ X1572 @ X1572)), inference(variable_rename,[status(thm)],[c_0_4])).
0.16/0.51	thf(c_0_8, plain, ![X3:a]:(((ord_less_int @ (h @ X3) @ (h @ x))|~((member_a @ X3 @ (binary504661350_eqs_a @ h @ e))))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.16/0.51	thf(c_0_9, negated_conjecture, (member_a @ esk1_0 @ (binary504661350_eqs_a @ h @ e)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.16/0.51	thf(c_0_10, negated_conjecture, ((h @ esk1_0)=(h @ x)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.16/0.51	thf(c_0_11, plain, ![X8:int]:(~((ord_less_int @ X8 @ X8))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.16/0.51	thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), c_0_11]), ['proof']).
0.16/0.51	# SZS output end CNFRefutation
0.16/0.51	# Parsed axioms                        : 404
0.16/0.51	# Removed by relevancy pruning/SinE    : 193
0.16/0.51	# Initial clauses                      : 345
0.16/0.51	# Removed in clause preprocessing      : 13
0.16/0.51	# Initial clauses in saturation        : 332
0.16/0.51	# Processed clauses                    : 26
0.16/0.51	# ...of these trivial                  : 0
0.16/0.51	# ...subsumed                          : 4
0.16/0.51	# ...remaining for further processing  : 22
0.16/0.51	# Other redundant clauses eliminated   : 5
0.16/0.51	# Clauses deleted for lack of memory   : 0
0.16/0.51	# Backward-subsumed                    : 0
0.16/0.51	# Backward-rewritten                   : 0
0.16/0.51	# Generated clauses                    : 9
0.16/0.51	# ...of the previous two non-redundant : 6
0.16/0.51	# ...aggressively subsumed             : 0
0.16/0.51	# Contextual simplify-reflections      : 0
0.16/0.51	# Paramodulations                      : 3
0.16/0.51	# Factorizations                       : 0
0.16/0.51	# NegExts                              : 0
0.16/0.51	# Equation resolutions                 : 5
0.16/0.51	# Propositional unsat checks           : 0
0.16/0.51	#    Propositional check models        : 0
0.16/0.51	#    Propositional check unsatisfiable : 0
0.16/0.51	#    Propositional clauses             : 0
0.16/0.51	#    Propositional clauses after purity: 0
0.16/0.51	#    Propositional unsat core size     : 0
0.16/0.51	#    Propositional preprocessing time  : 0.000
0.16/0.51	#    Propositional encoding time       : 0.000
0.16/0.51	#    Propositional solver time         : 0.000
0.16/0.51	#    Success case prop preproc time    : 0.000
0.16/0.51	#    Success case prop encoding time   : 0.000
0.16/0.51	#    Success case prop solver time     : 0.000
0.16/0.51	# Current number of processed clauses  : 17
0.16/0.51	#    Positive orientable unit clauses  : 10
0.16/0.51	#    Positive unorientable unit clauses: 0
0.16/0.51	#    Negative unit clauses             : 5
0.16/0.51	#    Non-unit-clauses                  : 2
0.16/0.51	# Current number of unprocessed clauses: 312
0.16/0.51	# ...number of literals in the above   : 781
0.16/0.51	# Current number of archived formulas  : 0
0.16/0.51	# Current number of archived clauses   : 0
0.16/0.51	# Clause-clause subsumption calls (NU) : 0
0.16/0.51	# Rec. Clause-clause subsumption calls : 0
0.16/0.51	# Non-unit clause-clause subsumptions  : 0
0.16/0.51	# Unit Clause-clause subsumption calls : 1
0.16/0.51	# Rewrite failures with RHS unbound    : 0
0.16/0.51	# BW rewrite match attempts            : 0
0.16/0.51	# BW rewrite match successes           : 0
0.16/0.51	# Condensation attempts                : 26
0.16/0.51	# Condensation successes               : 0
0.16/0.51	# Termbank termtop insertions          : 28795
0.16/0.51	
0.16/0.51	# -------------------------------------------------
0.16/0.51	# User time                : 0.019 s
0.16/0.51	# System time              : 0.012 s
0.16/0.51	# Total time               : 0.030 s
0.16/0.51	# Maximum resident set size: 3688 pages
0.16/0.51	
0.16/0.51	# -------------------------------------------------
0.16/0.51	# User time                : 0.032 s
0.16/0.51	# System time              : 0.014 s
0.16/0.51	# Total time               : 0.046 s
0.16/0.51	# Maximum resident set size: 2536 pages
0.16/0.51	EOF